Step-parallel algorithms for stiff initial value problems

MODIFIED K-STEP METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS

We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.

A new variable step size block backward differentiation formula for solving stiff initial value problems

modified k-step method for solving fuzzy initial value problems

we are concerned with the development of a k−step method for the numerical solution of fuzzy initial value problems. convergence and stability of the method are also proved in detail. moreover, a specific method of order 4 is found. the numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.

Trigonometrically fitted two-step obrechkoff methods for the numerical solution of periodic initial value problems

In this paper, we present a new two-step trigonometrically fitted symmetric Obrechkoff method. The method is based on the symmetric two-step Obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve IVPs with periodic solutions such as orbital problems. We compare the new method to some recently constructed optimized methods from the literature. The numeri...

An automatic multistep method for solving stiff initial value problems

A multistep method with matricial coefficients is developed. It can be used to solve stiff initial value problems of the form y’= Ay + g(x,y). This method bears the nature of the classical Adams-Bashforth-Moulton PC formula and can be shown to be consistent, convergent and A-stable. A careful reformulation of this method legitimatizes the implementation of this algorithm in a variable-step vari...